UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
نویسندگان
چکیده
منابع مشابه
Undecidability Bounds for Integer Matrices Using Claus Instances
There are several known undecidability problems for 3×3 integer matrices the proof of which uses a reduction from the Post Correspondence Problem (PCP). We establish new lower bounds in the numbers of matrices for the mortality, zero in left upper corner, vector reachability, matrix reachability, scaler reachability and freeness problems. Also, we give a short proof for a strengthened result du...
متن کاملOn Markov’s Undecidability Theorem for Integer Matrices
We study a problem considered originally by A. Markov in 1947: Given two matrix semigroups, determine whether or not they contain a common element. This problem was proved undecidable by Markov for 4×4 matrices, even in the very restrict form, and for 3× 3 matrices by Krom in 1981. Here we give a new proof in the 3× 3 case which gives undecidability in an almost as restricted form as the result...
متن کاملUndecidability of Infinite Post Correspondence Problem for Instances
In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word ω such that h(ω) = g(ω). This problem was shown to be undecidable by Ruohonen (1985) in general. Recently Blondel and Canterini (Theory Comput. Syst. 36 (2003) 231–245) showed that this problem is undecidable for domain al...
متن کاملUndecidability in Integer Weighted Finite Automata
It is shown that the universe problem L(A ) = A is undecidable for 4-state nite automata A with integer weights such that the weights of the paths are unimodal. The language L(A ) is de ned as the set of words w for which there exists a path of A having zero weight, that is, ( ) = 0.
متن کاملCarathéodory bounds for integer cones
Let b ∈ Zd be an integer conic combination of a finite set of integer vectors X ⊂ Zd . In this note we provide upper bounds on the size of a smallest subset X̃ ⊆ X such that b is an integer conic combination of elements of X̃ . We apply our bounds to general integer programming and to the cutting stock problem and provide an NP certificate for the latter, whose existence has not been known so far.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2007
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054107005066